Gradient Space Projection Projections onto the Hemisphere
نویسنده
چکیده
In this paper we present a simple method for handling projections on the hemisphere. The proposed method defines a coordinate system on the hemisphere surface that effectively converts the hemisphere to an infinite plane tangent to the top of the hemisphere, which is called the gradient space. Using this coordinate system, projections onto the hemisphere are replaced by simple perspective projections onto the gradient space. This approach totally eliminates the non-linearities caused by the spherical surface and permits exact hemisphere projection computations using only a single projection operation. We present different sampling techniques on the gradient space and provide qualitative comparisons.
منابع مشابه
ON THE CONTINUITY OF PROJECTIONS AND A GENERALIZED GRAM-SCHMIDT PROCESS
Let ? be an open connected subset of the complex plane C and let T be a bounded linear operator on a Hilbert space H. For ? in ? let e the orthogonal projection onto the null-space of T-?I . We discuss the necessary and sufficient conditions for the map ?? to b e continuous on ?. A generalized Gram- Schmidt process is also given.
متن کاملm-Projections involving Minkowski inverse and range symmetric property in Minkowski space
In this paper we study the impact of Minkowski metric matrix on a projection in the Minkowski Space M along with their basic algebraic and geometric properties.The relation between the m-projections and the Minkowski inverse of a matrix A in the minkowski space M is derived. In the remaining portion commutativity of Minkowski inverse in Minkowski Space M is analyzed in terms of m-projections as...
متن کاملCompact Convex Projections
We study the usefulness of conditional gradient like methods for determining projections onto convex sets, in particular, projections onto naturally arising convex sets in reproducing kernel Hilbert spaces. Our work is motivated by the recently introduced kernel herding algorithm which is closely related to the Conditional Gradient Method (CGM). It is known that the herding algorithm converges ...
متن کاملEfficient Sparseness-Enforcing Projections
We propose a linear time and constant space algorithm for computing Euclidean projections onto sets on which a normalized sparseness measure attains a constant value. These non-convex target sets can be characterized as intersections of a simplex and a hypersphere. Some previous methods required the vector to be projected to be sorted, resulting in at least quasilinear time complexity and linea...
متن کاملStrong Convergence of a Double Projection-type Method for Monotone Variational Inequalities in Hilbert Spaces
We introduce a projection-type algorithm for solving monotone variational inequality problems in real Hilbert spaces. We prove that the whole sequence of iterates converges strongly to a solution of the variational inequality. The method uses only two projections onto the feasible set in each iteration in contrast to other strongly convergent algorithms which either require plenty of projection...
متن کامل